S ep 1 99 9 Permutations avoiding a set of patterns T ⊆ S 3 and a pattern τ ∈
نویسنده
چکیده
In this paper we calculate the cardinality of the set Sn(T, τ) of all permutations in Sn that avoid one pattern from S4 and a nonempty set of patterns from S3. The main body of the paper is divided into four sections corresponding to the cases |T | = 1, 2, 3, and |T | ≥ 4. At the end of each section we provide the tables accumulating all the results obtained.
منابع مشابه
0 Permutations avoiding a pattern from S k and at least two patterns from S 3
In this paper, we find explicit formulas or generating functions for the cardinalities of the sets Sn(T, τ ) of all permutations in Sn that avoid a pattern τ ∈ Sk and a set T , |T | ≥ 2, of patterns from S3. The main body of the paper is divided into three sections corresponding to the cases |T | = 2, 3 and |T | ≥ 4. As an example, in the fifth section, we obtain the complete classification of ...
متن کاملRESTRICTED 132-AVOIDING k-ARY WORDS, CHEBYSHEV POLYNOMIALS, AND CONTINUED FRACTIONS
We study generating functions for the number of n-long k-ary words that avoid both 132 and an arbitrary `-ary pattern. In several interesting cases the generating function depends only on ` and is expressed via Chebyshev polynomials of the second kind and continued fractions. 1. Extended abstract 1.1. Permutations. Let Sn denote the set of permutations of [n] = {1, 2, . . . , n}, written in one...
متن کاملPermutations avoiding a pattern from Sk and at least two patterns from S3
In this paper, we find explicit formulas or generating functions for the cardinalities of the sets Sn(T, τ) of all permutations in Sn that avoid a pattern τ ∈ Sk and a set T , |T | ≥ 2, of patterns from S3. The main body of the paper is divided into three sections corresponding to the cases |T | = 2, 3 and |T | ≥ 4. As an example, in the fifth section, we obtain the complete classification of a...
متن کاملPermutations containing and avoiding certain patterns
Let T k = {σ ∈ Sk | σ1 = m}. We prove that the number of permutations which avoid all patterns in T k equals (k − 2)!(k − 1) n+1−k for k ≤ n. We then prove that for any τ ∈ T 1 k (or any τ ∈ T k k ), the number of permutations which avoid all patterns in T 1 k (or in T k k ) except for τ and contain τ exactly once equals (n + 1 − k)(k − 1)n−k for k ≤ n. Finally, for any τ ∈ T k , 2 ≤ m ≤ k − 1,...
متن کاملPattern Avoidance in Multiset Permutations: Bijective Proof
A permutation σ = σ1σ2 . . . σn of n letters contains the pattern τ = τ1τ2 . . . τk of k letters if for some i1 < i2 < · · · < ik we have σis < σit whenever τs < τt. A permutation is said to avoid any pattern it does not contain. It is well-known that the number of permutations of n letters that avoid a pattern τ of 3 letters is independent of τ . Savage and Wilf [3] have shown the same result ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008